Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation
نویسندگان
چکیده
منابع مشابه
Subquadratic Binary Field Multiplier in Double Polynomial System
We propose a new space efficient operator to multiply elements lying in a binary field F2k . Our approach is based on a novel system of representation called Double Polynomial System which set elements as a bivariate polynomials over F2. Thanks to this system of representation, we are able to use a Lagrange representation of the polynomials and then get a logarithmic time multiplier with a spac...
متن کاملSubquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
We study Dickson bases for binary field representation. Such representation seems interesting when no optimal normal basis exists for the field. We express the product of two elements as Toeplitz or Hankel matrix vector product. This provides a parallel multiplier which is subquadratic in space and logarithmic in time.
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملFinite Field Multiplier Using Redundant Representation
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclotomic ring which has a basis with the elegant multiplicative structure of a cyclic group. One important feature of our architectures is that they provide area-time trade-offs which enable us to implement the multiplier...
متن کاملScalable Systolic Multiplier over Binary Extension Fields Based on Two-Level Karatsuba Decomposition
Shifted polynomial basis (SPB) is a variation of polynomial basis representation. SPB has potential for efficient bit level and digi -level implementations of multiplication over binary extension fields with subquadratic space complexity. For efficient implementation of pairing computation with large finite fields, this paper presents a new SPB multiplication algorithm based on Karatsuba scheme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2010
ISSN: 0018-9340
DOI: 10.1109/tc.2010.141